Domain Decomposition for a Mixed Finite Element Method in Three Dimensions
نویسندگان
چکیده
منابع مشابه
Domain Decomposition for a Mixed Finite Element Method in Three Dimensions
We consider the solution of the discrete linear system resulting from a mixed finite element discretization applied to a second-order elliptic boundary value problem in three dimensions. Based on a decomposition of the velocity space, these equations can be reduced to a discrete elliptic problem by eliminating the pressure through the use of substructures of the domain. The practicality of the ...
متن کاملA Mixed Finite Element Method for Elasticity in Three Dimensions
We describe a stable mixed finite element method for linear elasticity in three dimensions.
متن کاملTWO-LEVEL DOMAIN DECOMPOSITION PRECONDITIONING FOR THE p-VERSION FINITE ELEMENT METHOD IN THREE DIMENSIONS
This paper presents a exible approach to domain decomposition preconditioning for problems expressed in terms of local stiiness matrices of subdomains. Evaluation of the preconditioner requires fully parallelizable local computations and the solution of a global auxiliary problem with few variables per subdomain. Convergence factors can be bounded using properties of the local stiiness matrices...
متن کاملParallel domain decomposition preconditioning for the adaptive finite element solution of elliptic problems in three dimensions
A novel weakly overlapping two level additive Schwarz domain decomposition preconditioning algorithm is presented which is appropriate for the parallel nite element solution of elliptic partial di erential equations in three dimensions. This algorithm allows each processor to be assigned one or more subdomains and, as with most parallel domain decomposition solvers, each processor is able to so...
متن کاملBalancing domain decomposition for mortar mixed finite element methods
The balancing domain decomposition method for mixed finite elements by Cowsar, Mandel, and Wheeler is extended to the case of mortar mixed finite elements on non-matching multiblock grids. The algorithm involves an iterative solution of a mortar interface problem with one local Dirichlet solve and one local Neumann solve per subdomain on each iteration. A coarse solve is used to guarantee that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2003
ISSN: 0036-1429,1095-7170
DOI: 10.1137/s0036142996296935